Job Grouping with Minimum Setup in PCB Assembly
نویسندگان
چکیده
We consider the machine setup problem of printed circuit board (PCB) assembly as a combination of a job grouping problem and a minimum setup problem. We formulate the problem as a MIP-model, where the objective is to minimize the weighted sum of the number of setup occasions and the total number of component feeder changes. We also present and evaluate hybrid algorithms based on both grouping and minimum setup heuristics. The best results are achieved by a method which uses both these strategies simultaneously.
منابع مشابه
Setup Optimization in High-Mix Surface Mount PCB Assembly Setup Optimization in High-Mix Surface Mount PCB Assembly
The thesis discusses machine setup problems which arise in high-mix, lowvolume production environments of printed circuit board assembly (PCB) industry. We concentrate especially on the hybrid setup problem that is a combination of the job grouping and minimum setup problems. We define an objective function that minimizes a weighted sum of the number of setup occasions and the number of feeder ...
متن کاملNew Formulation and Solution in PCB Assembly Systems with Parallel Batch processors
This paper considers the scheduling problem of parallel batch processing machines with non-identical job size and processing time. In this paper, a new mathematical model with ready time and batch size constraints is presented to formulate the problem mathematically, in which simultaneous reduction of the makespan and earliness-tardiness is the objective function. In recent years, the nature-in...
متن کاملGrouping components in printed circuit board assembly with limited component staging capacity and single card setup: problem characteristics and solution procedures
The problem of grouping Printed Circuit Board (PCB) components to minimize the total component and PCB loading cost subject to a capacity constraint on the number of types of components per group is formulated as an integer linear programming problem. The problem is shown to be NP-complete. Characteristics of the solution are outlined and a heuristic algorithm is discussed. For the case in whic...
متن کاملGroup sequencing a PCB assembly system via an expected sequence dependent setup heuristic
In circuit board manufacturing, the production sequencing problem with sequence dependent setups is complicated by the fact that the amount of setup required depends on not only the setup directly before the current setup, but can depend on all of the preceding setups. We present a case study that examines the use of a heuristic for estimating the expected number of setups from the sequence dep...
متن کامل